Ranking Revision Reloaded
نویسنده
چکیده
Ranking measures are coarse-grained, quasi-probabilistic plausibility valuations measuring the degree of surprise. Since Spohn’s work on the subclass of natural conditional functions, they have been used to model epistemic states and their dynamics. The simplest instance may be elementary ranking revision, which is a non-parametrized version of Spohn-style revision based on minimal Jeffreyconditionalization for ranking measures [Wey 05].
منابع مشابه
REVISION OF SIGN DISTANCE METHOD FOR RANKING OF FUZZY NUMBERS
Recently, Abbasbandy and Asady have been proposed a modificationof the distance based approach, namely ``sign distance method''.However, in this paper, it is shown that this method has some drawbacks, i.e.,the result is not consistent with human intuition for specialcases and this method cannot always logically infer rankingorder of the images of the fuzzy numbers. In this paper, wepresent a re...
متن کاملERSS 2005: Coreference-Based Summarization Reloaded
We present ERSS 2005, our entry to this year’s DUC competition. With only slight modifications from last year’s version to accommodate the more complex context information present in DUC 2005, we achieved a similar performance to last year’s entry, ranking roughly in the upper third when examining the ROUGE-1 and Basic Element score. We also participated in the additional manual evaluation base...
متن کاملRanking Revision with Conditional Knowledge Bases
We introduce a new model for belief dynamics where the belief states are ranking measures and the informational inputs are finite sets of parametrized conditionals interpreted by ranking constraints. The approach is inspired by the minimal information paradigm and generalizes ranking construction strategies developed for default reasoning. We show its handling of principles for conditional and ...
متن کاملRanking Functions, AGM Style
Ranking functions, having their first appearance under the name „ordinale Konditionalfunktionen“ in my Habilitationsschrift submitted in 1983, had several precursors of which I was only incompletely aware, among them Shackle’s functions of potential surprise (see Shackle 1969), Rescher’s plausibility indexing (see Rescher 1976), Adams’ ε-semantics (see Adams 1975), Cohen’s inductive probabiliti...
متن کاملSATEN: An Object-Oriented Web-Based Revision and Extraction Engine
SATEN is an object-oriented web-based extraction and belief revision engine. It runs on any computer via a Java 1.1 enabled browser such as Netscape 4. SATEN performs belief revision based on the AGM approach (Alchourrón et al 85). The extraction and belief revision reasoning engines operate on a user specified ranking of information. One of the features of SATEN is that it can be used to integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007